A Quadratic Bound on the Diameter of the Transportation Polytope
نویسندگان
چکیده
We prove that the combinatorial diameter of the skeleton of the polytope of feasible solutions of any m× n transportation problem is less than 12 (m + n). The transportation problem ( TP ) is a classic problem in operations research. The problem was posed for the first time by Hitchcock in 1941 [8] and independently by Koopmans in 1947 [11], and appears in any standard introductory course on operations research. The m × n TP has m supply points and n demand points. Each supply point i holds a quantity ri > 0, and each demand point j wants a quantity cj > 0, with m ∑
منابع مشابه
A Linear Bound On The Diameter Of The Transportation Polytope
We prove that the combinatorial diameter of the skeleton of the polytope of feasible solutions of any m× n transportation problem is at most 8 (m+ n− 2). The transportation problem (TP ) is a classic problem in operations research. The problem was posed for the first time by Hitchcock in 1941 [9] and independently by Koopmans in 1947 [12], and appears in any standard introductory course on oper...
متن کاملQuadratic Gröbner bases for smooth 3 × 3 transportation polytopes
The toric ideals of 3 × 3 transportation polytopes Trc are quadratically generated. The only exception is the Birkhoff polytope B3. If Trc is not a multiple of B3, these ideals even have square-free quadratic initial ideals. This class contains all smooth 3 × 3 transportation polytopes.
متن کاملAn Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function
In this paper, we consider convex quadratic semidefinite optimization problems and provide a primal-dual Interior Point Method (IPM) based on a new kernel function with a trigonometric barrier term. Iteration complexity of the algorithm is analyzed using some easy to check and mild conditions. Although our proposed kernel function is neither a Self-Regular (SR) fun...
متن کاملOffering a New Algorithm to Improve the Answer-Search Algorithm in Quadratic Assignment Problem
Layout design problem is one of the useful field of study used to increase the efficiency of sources in organizations. In order to achieve an appropriate layout design, it is necessary to define and solve the related nonlinear programming problems. Therefore, using computer in solving the related problems is important in the view of the researchers of this area of study. However, the designs pr...
متن کاملSolving the Single Machine Problem with Quadratic Earliness and Tardiness Penalties
Nowadays, scheduling problems have a considerable application in production and service systems. In this paper, we consider the scheduling of n jobs on a single machine assuming no machine idleness, non-preemptive jobs and equal process times. In many of previous researches, because of the delivery dalays and holding costs, earliness and tardiness penalties emerge in the form of linear combin...
متن کامل